A nonenumerative algorithm to find the k longest (shortest) paths in a DAG
نویسنده
چکیده
In this paper, we present a novel and efficient algorithm to find the k longest (shortest) paths between sources and sinks in a directed acyclic graph (DAG). The algorithm does not enumerate paths therefore it is especially useful for very large k values. It is based on the Valued-Sum-of-Product (VSOP) tool, which is an extension of Zero-suppressed Binary Decision Diagrams (ZBDDs). We assessed the performance of this algorithm with a DAG model of a path-intensive combinational circuit, viz. c6288, that has ∼ 10 20 paths. We found that it took about 64 minutes to compute all paths in this DAG along with their lengths.
منابع مشابه
Approximation Algorithms for Budget Constrained Network Upgradeable Problems
We study budget constrained network upgradeable problems. We are given an undirected edge weighted graph G = (V,E) where the weight an edge e ∈ E can be upgraded for a cost c(e). Given a budget B for improvement, the goal is to find a subset of edges to be upgraded so that the resulting network is optimum for B. The results obtained in this paper include the following. 1. Maximum Weight Constra...
متن کاملk-DAG Based Lifetime Aware Data Collection in Wireless Sensor Networks
Wireless Sensor Networks need to be organized for efficient data collection and lifetime maximization. In this paper, we propose a novel routing structure, namely k-DAG, to balance the load of the base station's neighbours while providing the worst-case latency guarantee for data collection, and a distributed algorithm for construction a k-DAG based on a SPD (Shortest Path DAG). In a k-DAG, the...
متن کاملInapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
We study the complexity of two Inverse Shortest Paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph, the task is to find positive integer arc lengths such that the given paths are uniquely determined shortest paths between their respective terminals. The first problem seeks for arc lengths that...
متن کاملA New Algorithm for the Discrete Shortest Path Problem in a Network Based on Ideal Fuzzy Sets
A shortest path problem is a practical issue in networks for real-world situations. This paper addresses the fuzzy shortest path (FSP) problem to obtain the best fuzzy path among fuzzy paths sets. For this purpose, a new efficient algorithm is introduced based on a new definition of ideal fuzzy sets (IFSs) in order to determine the fuzzy shortest path. Moreover, this algorithm is developed for ...
متن کاملEnumerating K best paths in length order in DAGs
We address the problem of finding the K best paths connecting a given pair of nodes in a directed acyclic graph (DAG) with arbitrary lengths. One of the main results in this paper is the proof that a tree representing the kth shortest path is obtained by an arc exchange in one of the previous (k-1) trees (each of which contains a previous best path). An O( ( log ) m K n K ) time and O(K+m) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1301.0181 شماره
صفحات -
تاریخ انتشار 2013